翻訳と辞書 Words near each other ・ Filter paper ・ Filter press ・ Filter Room ・ Filter strip ・ Filter Theatre ・ Filter theory (sociology) ・ Filter transition region ・ Filtered Air Positive Pressure ・ Filtered algebra ・ Filtered beer ・ Filtered category ・ Filtered Containment Venting System ・ Filtered esophageal left heart electrogram ・ Filtered Rayleigh scattering ・ Filtered water ・ Filtered-popping recursive transition network ・ Filterheadz ・ Filteria ・ Filtering problem (stochastic processes) ・ FilterKeys ・ Filterset.G ・ FiLTH ・ Filth ・ Filth (Andrew Dice Clay album) ・ Filth (band) ・ Filth (film) ・ Filth (novel) ・ Filth (Swans album) ・ Filth (Venetian Snares album) ・ Filth and Dreams Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Filtered-popping recursive transition network ： ウィキペディア英語版 Filtered-popping recursive transition network A filtered-popping recursive transition network (FPRTN),〔Javier M. Sastre, ("Efficient parsing using filtered-popping recursive transition networks" ), ''Lecture Notes in Artificial Intelligence'', 5642:241-244, 2009〕 or simply filtered-popping network (FPN), is a recursive transition network (RTN)〔 William A. Woods, ("Transition network grammars for natural language analysis" ), ''Communications of the ACM'', ''ACM Press'', 13:10:591-606, 1970〕 extended with a map of states to keys where returning from a subroutine jump requires the acceptor and return states to be mapped to the same key. RTNs are finite-state machines that can be seen as finite-state automata extended with a stack of return states; as well as consuming transitions and $\backslash varepsilon$-transitions, RTNs may define call transitions. These transitions perform a subroutine jump by pushing the transition's target state onto the stack and bringing the machine to the called state. Each time an acceptor state is reached, the return state at the top of the stack is popped out, provided that the stack is not empty, and the machine is brought to this state. Throughout this article we refer to filtered-popping recursive transition networks as ''FPNs'', though this acronym is ambiguous (e.g.: fuzzy Petri nets). ''Filtered-popping networks'' and ''FPRTNs'' are unambiguous alternatives. ==Formal Definition== A FPN is a structure $(Q,\; K,\; \backslash Sigma,\; \backslash delta,\; \backslash kappa,\; Q\_I,\; F)$ where *$Q$ is a finite set of states, *$K$ is a finite set of keys, *$\backslash Sigma$ is a finite input alphabet, *$\backslash delta:\; Q\; \backslash times\; (\backslash Sigma\; \backslash cup\; \backslash \; \backslash cup\; Q)\; \backslash to\; Q$ is a partial transition function, $\backslash varepsilon$ being the empty symbol, *$\backslash kappa:\; Q\; \backslash to\; K$ is a map of states to keys, *$Q\_I\; \backslash subseteq\; Q$ is the set of initial states, and *$F\; \backslash subseteq\; Q$ is the set of acceptance states. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Filtered-popping recursive transition network」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.